Transformation of Polynomial Evaluation to a Pipeline via Horner's Rule
نویسندگان
چکیده
We apply algebraic transformation techniques to synthesise Horner’s rule for polynomial evaluation. Horner’s rule is then transformed into a pipeline by the application of further axioms. The syntheses demonstrate the power of the algebraic style, in which inductive proof is replaced by constructive unfolding and folding of standard higher-order functions defined on lists.
منابع مشابه
An e cient algorithm for evaluating polynomials in the P olya basis
A new O(n) algorithm is given for evaluating univariate polynomials of degree n in the P olya basis. Since the Lagrange, Bernstein, and monomial bases are all special instances of the P olya basis, this technique leads to e cient evaluation algorithms for these special bases. For the monomial basis, this algorithm is shown to be equivalent to Horner's rule. 1 P olya basis functions Let nk(t) be...
متن کاملEfficient Polynomial Evaluation Algorithm and Implementation on FPGA
In this thesis, an optimized polynomial evaluation algorithm is presented. Compared to Horner’s Rule which has the least number of computation steps but longest latency, or parallel evaluation methods like Estrin’s method which are fast but with large hardware overhead, the proposed algorithm could achieve high level of parallelism with smallest area, by means of replacing multiplication with s...
متن کاملSignal Flow Graph Approach to Inversion of (H,m)–quasiseparable Vandermonde Matrices and New Filter Structures
We use the language of signal flow graph representation of digital filter structures to solve three purely mathematical problems, including fast inversion of certain polynomial–Vandermonde matrices, deriving an analogue of the Horner and Clenshaw rules for polynomial evaluation in a (H, m)–quasiseparable basis, and computation of eigenvectors of (H, m)– quasiseparable classes of matrices. While...
متن کاملHorner’s Rule Is Optimal for Polynomial Nullity
The value VF,n(a0, . . . , an, b) = a0 + a1b+ a2b 2 + · · ·+ anb of a polynomial of degree n ≥ 1 over a field F can be computed by Horner’s rule using no more than nmultiplications in F , and it is optimal (for many fields, including the reals R and the complexes C) for the number of multiplications and/or divisions required, cf. Pan [1966], Winograd [1967, 1970]. We show that Horner’s rule is ...
متن کاملEfficient Implementation of Higher Order Image Interpolation
This work presents a new method of fast cubic and higher order image interpolation. The evaluation of the piecewise n-th order polynomial kernels is accelerated by transforming the polynomials into the interval [0, 1], which has the advantage that some terms of the polynomials disappear, and that several coefficients could be precalculated, which is proven in the paper. The results are exactly ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Sci. Comput. Program.
دوره 24 شماره
صفحات -
تاریخ انتشار 1995